Extensional Normalization in the Logical Framework with Proof Irrelevant Equality
نویسنده
چکیده
We extend the Logical Framework by proof irrelevant equality types and present an algorithm that computes unique long normal forms. The algorithm is inspired by normalization-by-evaluation. Equality proofs which are not reflexivity are erased to a single object ∗. The algorithm decides judgmental equality, its completeness is established by a PER model.
منابع مشابه
Semantics of Intensional Type Theory extended with Decidable Equational Theories
Incorporating extensional equality into a dependent intensional type system such as the Calculus of Constructions (CC) provides with stronger type-checking capabilities and makes the proof development closer to intuition. Since strong forms of extensionality generally leads to undecidable type-checking, it seems a reasonable trade-off to extend intensional equality with a decidable first-order ...
متن کاملExtensional Equality in Intensional Type Theory
We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, intensional setoid model in Intensional Type theory with a proof-irrelevant universe of propositions and -rules for and -types. The Type Theory corresponding to this model is decidable, has no irreducible constants and per...
متن کاملThe Functional Interpretation of Direct Computations
The concept of direct computation used by Statman (1977) was instrumental in the development of a notion of normal form for proofs of equality. In order to find a functional (Curry–Howard style) interpretation of direct computations we take a closer look at proof procedures for first-order sentences with equality drawing the attention to the need for introducing (function) symbols for rewrites....
متن کاملOn Irrelevance and Algorithmic Equality in Predicative Type Theory
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To separate static and dynamic code, several static analyses and type systems have been put forward. We consider Pfenning’s type theory with irrelevant quantification which is compatible with a type-based notion of equality that respects η-laws. W...
متن کاملConcurrency in Proof Normalization and Logic Programming
1 . In t roduct ion Proof normalization has a long history in mathematical logic [Prawitz 1965]. The significant result for computer science is as follows: // there is a proof of the formula 3z(A(z)), one can get an answer t, which satisfies A(t), after normalizing the proof. This realizes a computation, which is appropriately called logic programming. However, it is less efficient than Prolog....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009